/*
 * Quercia Luciano
 * Algoritmi e Strutture Dati
 * a.a. 2009-10
 */


#include <iostream>
#include "prioricoda.h"


int main() {
	try {
		PrioriCoda<int> q;

		q.inserisci(3);
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(4);
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(5);
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(1);
		cout << "MINIMO = " << q.min() << endl;
		q.cancellaMin();
		cout << "MINIMO = " << q.min() << endl;
		q.cancellaMin();
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(0);
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(-1);
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(-100);
		cout << "MINIMO = " << q.min() << endl;
		q.inserisci(-3);
		cout << "MINIMO = " << q.min() << endl;
		q.cancellaMin();
		cout << "MINIMO = " << q.min() << endl;
		q.cancellaMin();
		cout << "MINIMO = " << q.min() << endl;

	} catch (char const * mex) {
		cout << mex;
	}
	return 0;
}
